Probabilistic Context-Free Grammars for Syllabification and Grapheme-to-Phoneme Conversion
نویسنده
چکیده
We investigated the applicability of probabilistic context-free grammars to syllabi cation and grapheme-to-phoneme conversion. The results show that the standard probability model of context-free grammars performs very well in predicting syllable boundaries. However, our results indicate that the standard probability model does not solve grapheme-to-phoneme conversion su ciently although, we varied all free parameters of the probabilistic reestimation procedure.
منابع مشابه
Language-independent Grapheme-phoneme Conversion and Word Stress Assignment as a Web Service
We introduce a new language-independent procedure for grapheme-phoneme conversion, syllabification, and word stress assignment. Grapheme-phoneme conversion and syllabification is carried out by means of fallback sequences of decision trees trained on varying context sizes. Word stress is determined within an analogy-based framework by means of a Bayes classifier. Evaluation results on six langu...
متن کاملLetter-to-Phoneme Conversion for a German Text-to-Speech System
This thesis deals with the conversion from letters to phonemes, syllabification and word stress assignment for a German text-to-speech system. In the first part of the thesis (chapter 5), several alternative approaches for morphological segmentation are analysed and the benefit of such a morphological preprocessing component is evaluated with respect to the grapheme-to-phoneme conversion algori...
متن کاملUnlimited Vocabulary Grapheme to PhonemeConversion with Probabilistic Phrase Break Detection
This paper describes a grapheme-to-phoneme conversion method using phoneme con-nectivity and CCV conversion rules with probabilistic phrase break detection. The method consists of mainly four modules including phrase-break detection, morpheme normalization, morpheme to phoneme conversion and phoneme connectivity check. In the experiments with a test corpus of 210 sentences, we achieved 85% of p...
متن کاملConditional and joint models for grapheme-to-phoneme conversion
In this work, we introduce several models for grapheme-tophoneme conversion: a conditional maximum entropy model, a joint maximum entropy n-gram model, and a joint maximum entropy n-gram model with syllabification. We examine the relative merits of conditional and joint models for this task, and find that joint models have many advantages. We show that the performance of our best model, the joi...
متن کاملPermA and Balloon: Tools for string alignment and text processing
Two online research tools are presented in this paper: PermA, a general-purpose string aligner which can for example be used for grapheme-to-phoneme and phonemeto-phoneme alignment, and Balloon, a text processing toolkit for German and English providing components for part-of-speech tagging, morphological analyses, and grapheme-to-phoneme conversion including syllabification and word-stress ass...
متن کامل